Graphs with three distinct distance eigenvalues
نویسندگان
چکیده
In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family trees with eigenvalue −1, and determine all triangle-free connected three distinct eigenvalues which the smallest one is equal to −3. Furthermore, characterize eigenvalues.
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملGraphs with few distinct distance eigenvalues irrespective of the diameters
The distance matrix of a simple connected graph G is D(G) = (dij), where dij is the distance between ith and jth vertices of G. The multiset of all eigenvalues of D(G) is known as the distance spectrum of G. Lin et al.(On the distance spectrum of graphs. Linear Algebra Appl., 439:1662-1669, 2013) asked for existence of graphs other than strongly regular graphs and some complete k-partite graphs...
متن کاملMore on Graphs with Just Three Distinct Eigenvalues
Let G be a graph of order n with (0, 1)-adjacency matrix A. An eigenvalue σ of A is said to be an eigenvalue of G, and σ is a main eigenvalue if the eigenspace EA(σ) is not orthogonal to the all-1 vector in IR. Always the largest eigenvalue, or index, of G is a main eigenvalue, and it is the only main eigenvalue if and only if G is regular. We say that G is an integral graph if every eigenvalue...
متن کاملGraphs with three distinct eigenvalues and largest eigenvalue less than
Article history: Received 13 June 2008 Accepted 13 November 2008 Available online xxxx Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملOn graphs with three eigenvalues
We consider undirected non-regular connected graphs without loops and multiple edges (other than complete bipartite graphs) which have exactly three distinct eigenvalues (such graphs are called non-standard graphs). The interest in these graphs is motivated by the questions posed by W. Haemers during the 15th British Combinatorial Conference (Stirling, July 1995); the main question concerned th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2023
ISSN: ['1873-5649', '0096-3003']
DOI: https://doi.org/10.1016/j.amc.2023.127848